Path analysis

Results: 442



#Item
21International Journal of Robotics and Automation, 2015  PATH PLANNING FOR VISUAL SERVOING AND NAVIGATION USING CONVEX OPTIMIZATION Abdul Hafez Abdul Hafez,∗ Anil K. Nelakanti,∗∗ and C.V. Jawahar∗∗∗

International Journal of Robotics and Automation, 2015 PATH PLANNING FOR VISUAL SERVOING AND NAVIGATION USING CONVEX OPTIMIZATION Abdul Hafez Abdul Hafez,∗ Anil K. Nelakanti,∗∗ and C.V. Jawahar∗∗∗

Add to Reading List

Source URL: cvit.iiit.ac.in

Language: English - Date: 2015-05-12 10:40:01
22Ingo Scholtes, Nicolas Wider, Antonios Garas: Higher-Order Aggregate Networks in the Analysis of Temporal Networks Higher-Order Aggregate Networks in the Analysis of Temporal Networks: Path structures and centralities

Ingo Scholtes, Nicolas Wider, Antonios Garas: Higher-Order Aggregate Networks in the Analysis of Temporal Networks Higher-Order Aggregate Networks in the Analysis of Temporal Networks: Path structures and centralities

Add to Reading List

Source URL: www.sg.ethz.ch

Language: English - Date: 2015-08-27 04:09:04
23Fast Control Plane Analysis Using an Abstract Representation Aaron Gember-Jacobson∗◦ , Raajay Viswanathan∗◦ , Aditya Akella◦ , Ratul Mahajan† ◦  University of Wisconsin-Madison, † Microsoft Research

Fast Control Plane Analysis Using an Abstract Representation Aaron Gember-Jacobson∗◦ , Raajay Viswanathan∗◦ , Aditya Akella◦ , Ratul Mahajan† ◦ University of Wisconsin-Madison, † Microsoft Research

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2016-07-25 15:03:50
24PI MU EPSILON JOURNAL THE OCTIOAL PUBLICATIONOF THEHONORARYMAnffiMATICALFRATERNITY  VOLUME 2

PI MU EPSILON JOURNAL THE OCTIOAL PUBLICATIONOF THEHONORARYMAnffiMATICALFRATERNITY VOLUME 2

Add to Reading List

Source URL: www.pme-math.org

Language: English - Date: 2013-10-17 15:52:19
25Abstract of “Sampling-based Randomized Algorithms for Big Data Analytics” by Matteo Riondato, Ph.D., Brown University, MayAnalyzing huge datasets becomes prohibitively slow when the dataset does not fit in mai

Abstract of “Sampling-based Randomized Algorithms for Big Data Analytics” by Matteo Riondato, Ph.D., Brown University, MayAnalyzing huge datasets becomes prohibitively slow when the dataset does not fit in mai

Add to Reading List

Source URL: matteo.rionda.to

Language: English - Date: 2016-07-30 12:22:15
26Path Integral Methods for Continuum Quantum Systems D. Ceperley University of Illinois Urbana-Champaign  • 

Path Integral Methods for Continuum Quantum Systems D. Ceperley University of Illinois Urbana-Champaign • 

Add to Reading List

Source URL: www.cond-mat.de

Language: English - Date: 2013-09-26 12:50:05
27Bachelor / Master Thesis  Shortest paths in disk coverings Description. Suppose you are travelling from town A to town B with a mobile communication device. To ensure you never lose connection, you decide to travel only

Bachelor / Master Thesis Shortest paths in disk coverings Description. Suppose you are travelling from town A to town B with a mobile communication device. To ensure you never lose connection, you decide to travel only

Add to Reading List

Source URL: page.math.tu-berlin.de

Language: English
28Retargetable Infeasible Path Detection for WCET Analysis Zach Hall, Kory Kraft, Thomas Mincher, Joey Iannetta, Chris Healy Department of Computer Science Furman University

Retargetable Infeasible Path Detection for WCET Analysis Zach Hall, Kory Kraft, Thomas Mincher, Joey Iannetta, Chris Healy Department of Computer Science Furman University

Add to Reading List

Source URL: www.control.lth.se

Language: English - Date: 2015-07-09 03:36:07
29Trace-Driven Analysis of ICN Caching Algorithms on Video-on-Demand Workloads Yi Sun⊗ , Seyed K. Fayaz† , Yang Guo⊗ , Vyas Sekar† Yun Jin , Mohamed Ali Kaafar∗ , Steve Uhlig◦ ⊗

Trace-Driven Analysis of ICN Caching Algorithms on Video-on-Demand Workloads Yi Sun⊗ , Seyed K. Fayaz† , Yang Guo⊗ , Vyas Sekar† Yun Jin , Mohamed Ali Kaafar∗ , Steve Uhlig◦ ⊗

Add to Reading List

Source URL: conferences2.sigcomm.org

Language: English - Date: 2014-12-01 16:58:21
30CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014

CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2015-01-04 19:18:44